An Architecture for the Combination of Constraint Solvers
نویسندگان
چکیده
In this paper, an architecture for the combination of diierent constraint solvers with the help of projections is proposed. By means of the deenition of an interface and restricting properties of the operations of constraint solvers we are able to deene a mechanism for the open and consistent combination of constraint systems. We enable the use of a functional logic language as constraint solver for constraints over functional expressions in the overall system. The syntax of a language which allows the speciication of mixed constraints of different constraint domains and its operational semantics are introduced. We compare our approach with BALI, an environment for designing and executing constraint solver combinations.
منابع مشابه
An Architecture for Cooperating Constraint Solvers on Reals
In this paper we introduce a cooperative scheme for solving systems of constraints over the reals. First, we informally show how an appropriate combination of symbolic and numeric solvers makes it possible to solve problems that none of these solvers can tackle alone. Then, we specify a cooperative architecture which allows to use concurrently heterogeneous solvers when handling constraints ove...
متن کاملAn improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملMeta-S - Combining Solver Cooperation and Programming Languages
Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative languages. We sketch the main aspects of Meta-S including solver and language integration as well as its strategy definition framework for specifying solver cooperation and language evaluation strategies by means of an example. ...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملAn Environment for Designing / Executing Constraint
Constraint logic programming is a paradigm based on the notion of constraints and mechanisms for their resolution. The new concept of solver collaboration enables to solve problems that cannot be tackled or eeciently solved with a single solver. We propose BALI, an environment for designing/executing solver collaborations. BALI is a heterogeneous distributed col-laborative problem solving syste...
متن کامل